A Logical Framework for Convergent Infinite Computations

نویسندگان

Wei Li

Shilong Ma

Yuefei Sui

Ke Xu

چکیده

Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations. A logic for convergent infinite computations is proposed by extending first order theories using Cauchy sequences, which has stronger expressive power than the first order logic. A class of fixed points characterizing the logical properties of the limits can be represented by means of infinite-length terms defined by Cauchy sequences. We will show that the limit of sequence of first order theories can be defined in terms of distance, similar to the ǫ −N style definition of limits in real analysis. On the basis of infinitary terms, a computation model for convergent infinite computations is proposed. Finally, the interpretations of logic programs are extended by introducing real Herbrand models of logic programs and a sufficient condition for computing a real Herbrand model of Horn logic programs using convergent infinite computation is given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 3 Ju l 2 00 1 A Logical Framework for Convergent Infinite Computations

Classical computations can not capture the essence of infinite computations very well. We will focus on a class of infinite computations called convergent infinite computations and, based on the study of the sequences of first order theories and their limits (Li, 1992), establish a logical framework for describing and analyzing how an infinite computation interacts and evolves in changing envir...

متن کامل

0 M ay 2 00 1 A Logical Framework for Convergent Infinite Computations ( Extended

1.Introduction The need of studying infinite computations has been emphasized in recent years, e.g., see (Vardi and Wolper, 1994). By infinite computations, one means the computations done by some programs that create non-terminating processes or very long-time running processes. For such programs, the computations done by them usually go through infinite sequences of running states (or configu...

متن کامل

A Minimal Computational Theory of a Minimal Computational Universe

In [3] a general logical framework for formalizing set theories of different strength was suggested. We here employ that framework, focusing on the exploration of computational theories. That is, theories whose set of closed terms suffices for denoting every concrete set (including infinite ones) that might be needed in applications, as well as for computations with sets. We demonstrate that al...

متن کامل

Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic

Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained ...

متن کامل